Polynomial sequences of integral type
نویسندگان
چکیده
منابع مشابه
Matrix computation of subresultant polynomial remainder sequences in integral domains
We present an impr{wed variant of the matrix-triangularization subresultant prs method [1] fi~r the computation of a greatest comnum divi~w of two polynomials A and B (of degrees m and n, respectively) along with their polynomial remainder ~quence. It is impr~wed in the sense that we obtain complete theoretical results, independent {}f Van Vleck's theorem [13] (which is not always tnle [2, 6]),...
متن کاملSchur Type Functions Associated with Polynomial Sequences of Binomial Type
We introduce a class of Schur type functions associated with polynomial sequences of binomial type. This can be regarded as a generalization of the ordinary Schur functions and the factorial Schur functions. This generalization satisfies some interesting expansion formulas, in which there is a curious duality. Moreover this class includes examples which are useful to describe the eigenvalues of...
متن کاملRoot Geometry of Polynomial Sequences I: Type (0, 1)
This paper is concerned with the distribution in the complex plane of the roots of a polynomial sequence {Wn(x)}n≥0 given by a recursion Wn(x) = aWn−1(x) + (bx + c)Wn−2(x), with W0(x) = 1 and W1(x) = t(x − r), where a > 0, b > 0, and c, t, r ∈ R. Our results include proof of the distinct-real-rootedness of every such polynomial Wn(x), derivation of the best bound for the zero-set {x | Wn(x) = 0...
متن کاملPolynomial Sequences of Binomial Type and Path Integrals
Polynomial sequences pn(x) of binomial type are a principal tool in the umbral calculus of enumerative combinatorics. We express pn(x) as a path integral in the “phase space” N× [−π, π]. The Hamiltonian is h(φ) = ∑n=0 p ′ n(0)/n!e inφ and it produces a Schrödinger type equation for pn(x). This establishes a bridge between enumerative combinatorics and quantum field theory. It also provides an a...
متن کاملPolynomial Sequences of Binomial-Type Arising in Graph Theory
In this paper, we show that the solution to a large class of “tiling” problems is given by a polynomial sequence of binomial type. More specifically, we show that the number of ways to place a fixed set of polyominos on an n × n toroidal chessboard such that no two polyominos overlap is eventually a polynomial in n, and that certain sets of these polynomials satisfy binomial-type recurrences. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1980
ISSN: 0022-247X
DOI: 10.1016/0022-247x(80)90168-7